Two Semi-Lagrangian Fast Methods for Hamilton-Jacobi-Bellman Equations
نویسندگان
چکیده
In this paper we apply the Fast Iterative Method (FIM) for solving general Hamilton–Jacobi–Bellman (HJB) equations and we compare the results with an accelerated version of the Fast Sweeping Method (FSM). We find that FIM can be indeed used to solve HJB equations with no relevant modifications with respect to the original algorithm proposed for the eikonal equation, and that it overcomes FSM in many cases. Observing the evolution of the active list of nodes for FIM, we recover another numerical validation of the arguments recently discussed in [1] about the impossibility of creating local single-pass methods for HJB equations.
منابع مشابه
Convergent Semi-Lagrangian Methods for the Monge-Ampère Equation on Unstructured Grids
This paper is concerned with developing and analyzing convergent semi-Lagrangian methods for the fully nonlinear elliptic Monge–Ampère equation on general triangular grids. This is done by establishing an equivalent (in the viscosity sense) Hamilton–Jacobi–Bellman formulation of the Monge–Ampère equation. A significant benefit of the reformulation is the removal of the convexity constraint from...
متن کاملAn Adaptive Sparse Grid Semi-Lagrangian Scheme for First Order Hamilton-Jacobi Bellman Equations
We propose a semi-Lagrangian scheme using a spatially adaptive sparse grid to deal with non-linear time-dependent Hamilton-Jacobi Bellman equations. We focus in particular on front propagation models in higher dimensions which are related to control problems. We test the numerical efficiency of the method on several benchmark problems up to space dimension d = 8, and give evidence of convergenc...
متن کاملBoundary Treatment and Multigrid Preconditioning for Semi-Lagrangian Schemes Applied to Hamilton-Jacobi-Bellman Equations
We analyse two practical aspects that arise in the numerical solution of HamiltonJacobi-Bellman (HJB) equations by a particular class of monotone approximation schemes known as semi-Lagrangian schemes. These schemes make use of a wide stencil to achieve convergence and result in discretization matrices that are less sparse and less local than those coming from standard finite difference schemes...
متن کاملOrdered Upwind Methods for Static Hamilton-Jacobi Equations: Theory and Algorithms
We develop a family of fast methods for approximating the solutions to a wide class of static Hamilton–Jacobi PDEs; these fast methods include both semi-Lagrangian and fully Eulerian versions. Numerical solutions to these problems are typically obtained by solving large systems of coupled nonlinear discretized equations. Our techniques, which we refer to as “Ordered Upwind Methods” (OUMs), use ...
متن کاملA Fast Marching Method for Hamilton-Jacobi Equations Modeling Monotone Front Propagations
In this paper we present a generalization of the Fast Marching method introduced by J. A. Sethian in 1996 to solve numerically the eikonal equation. The new method, named Buffered Fast Marching (BFM), is based on a semi-Lagrangian discretization and is suitable for Hamilton-Jacobi equations modeling monotonically advancing fronts, including Hamilton-Jacobi-Bellman and Hamilton-JacobiIsaacs equa...
متن کامل